runtime.addrRange.base (field)
35 uses
runtime (current package)
mgcscavenge.go#L564: newBase := alignDown(r.base.addr(), pallocChunkBytes)
mgcscavenge.go#L570: r.base = offAddr{newBase}
mgcscavenge.go#L580: if r.base.addr()%pallocChunkBytes != 0 {
mgcscavenge.go#L612: if work.base.addr()%pallocChunkBytes != 0 {
mgcscavenge.go#L650: for i := chunkIndex(work.limit.addr() - 1); i >= chunkIndex(work.base.addr()); i-- {
mgcscavenge.go#L685: work.limit = work.base
mpagealloc_64bit.go#L107: sumIdxBase, sumIdxLimit := addrsToSummaryRange(level, r.base.addr(), r.limit.addr())
mpagealloc_64bit.go#L175: sysMap(unsafe.Pointer(need.base.addr()), need.size(), p.sysStat)
mpagealloc_64bit.go#L176: sysUsed(unsafe.Pointer(need.base.addr()), need.size())
mranges.go#L26: base, limit offAddr
mranges.go#L42: if !a.base.lessThan(a.limit) {
mranges.go#L47: return a.limit.diff(a.base)
mranges.go#L52: return a.base.lessEqual(offAddr{addr}) && (offAddr{addr}).lessThan(a.limit)
mranges.go#L60: if b.base.lessEqual(a.base) && a.limit.lessEqual(b.limit) {
mranges.go#L62: } else if a.base.lessThan(b.base) && b.limit.lessThan(a.limit) {
mranges.go#L64: } else if b.limit.lessThan(a.limit) && a.base.lessThan(b.limit) {
mranges.go#L65: a.base = b.limit
mranges.go#L66: } else if a.base.lessThan(b.base) && b.base.lessThan(a.limit) {
mranges.go#L67: a.limit = b.base
mranges.go#L75: if (offAddr{addr}).lessEqual(a.base) {
mranges.go#L81: return makeAddrRange(a.base.addr(), addr)
mranges.go#L192: if base.lessThan(a.ranges[i].base) {
mranges.go#L210: if base.lessThan(a.ranges[i].base) {
mranges.go#L225: return a.ranges[0].base.addr(), true
mranges.go#L231: return a.ranges[i].base.addr(), true
mranges.go#L261: print("runtime: range = {", hex(r.base.addr()), ", ", hex(r.limit.addr()), "}\n")
mranges.go#L266: i := a.findSucc(r.base.addr())
mranges.go#L267: coalescesDown := i > 0 && a.ranges[i-1].limit.equal(r.base)
mranges.go#L268: coalescesUp := i < len(a.ranges) && r.limit.equal(a.ranges[i].base)
mranges.go#L284: a.ranges[i].base = r.base